Tree Cover of Accra’s Neighbourhoods—a Green Divide
نویسندگان
چکیده
منابع مشابه
Birdsong tuned to the environment: green hylia song varies with elevation, tree cover, and noise
Alexander N. G. Kirschel, Daniel T. Blumstein, Rachel E. Cohen, Wolfgang Buermann, Thomas B. Smith, and Hans Slabbekoorn Department of Ecology and Evolutionary Biology, University of California, 621 Charles E. Young Dr. South, Los Angeles, CA 90095-1606, USA, Center for Tropical Research, Institute of the Environment, University of California, La Kretz Hall, Suite 300, 619 Charles E. Young Dr. ...
متن کاملCover tree Bayesian reinforcement learning
This paper proposes an online tree-based Bayesian approach for reinforcement learning. For inference, we employ a generalised context tree model. This defines a distribution on multivariate Gaussian piecewise-linear models, which can be updated in closed form. The tree structure itself is constructed using the cover tree method, which remains efficient in high dimensional spaces. We combine the...
متن کاملGeneralized Bounded Tree Cover of a Graph
A tree cover of a graph is a collection of subgraphs such that each vertex is a part of at least one subgraph and each subgraph is a tree. The bounded tree cover problem (BTC) finds a tree cover with minimum number of trees of bounded weight. This paper considers several generalized versions of BTC. The first problem deals with graphs having multiple metric weight functions. Strong and weak tre...
متن کاملDivide-and-Conquer Approximation Algorithm for Vertex Cover
The vertex cover problem is a classical NP-complete problem for which the best worstcase approximation ratio is 2−o(1). In this paper, we use a collection of simple graph transformations, each of which guarantees an approximation ratio of 3 2 , to find approximate vertex covers for a large collection of randomly generated graphs and test graphs from various sources. The graph reductions are ext...
متن کاملApproximating the minmax rooted-tree cover in a tree
Given an edge-weighted rooted tree T and a positive integer p ( n), where n is the number of vertices in T , we cover all vertices in T by a set of p subtrees each of which contains the root r of T . The minmax rooted-tree cover problem asks to find such a set of p subtrees so as to minimize the maximum weight of the subtrees in the set. In this paper, we propose an O(n) time (2 + ε)-approximat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Urban Forum
سال: 2019
ISSN: 1015-3802,1874-6330
DOI: 10.1007/s12132-019-09364-6